Characterizing the relationship between ILU-type preconditioners and the storage hierarchy
نویسندگان
چکیده
ILU-type preconditioning techniques are widely recognized as being an extremely effective approach to providing efficient solvers[1]. These techniques have been used to increase the performance and reliability of Krylov subspace methods. However, a drawback of these approaches is that it is difficult to choose appropriate values for the preconditioner tuning parameters[2]. Usually, parameter selection is done through trial-and-error for a few sample matrices for a given application.
منابع مشابه
ILU and IUL factorizations obtained from forward and backward factored approximate inverse algorithms
In this paper, an efficient dropping criterion has been used to compute the IUL factorization obtained from Backward Factored APproximate INVerse (BFAPINV) and ILU factorization obtained from Forward Factored APproximate INVerse (FFAPINV) algorithms. We use different drop tolerance parameters to compute the preconditioners. To study the effect of such a dropping on the quality of the ILU ...
متن کاملHigh order ILU preconditioners for CFD problems
This paper tests a number of ILU-type preconditioners for solving indeenite linear systems which arise from complex applications such as Computational Fluid Dynamics. Both point and block preconditioners are considered. The paper focuses on ILU factorization which can be computed with high accuracy by allowing liberal amounts of ll-in. A number of strategies for enhancing the stability of the f...
متن کاملParallel Multilevel Block ILU Preconditioning Techniques for Large Sparse Linear Systems
We present a class of parallel preconditioning strategies built on a multilevel block incomplete LU (ILU) factorization technique to solve large sparse linear systems on distributed memory parallel computers. The preconditioners are constructed by using the concept of block independent sets. Two algorithms for constructing block independent sets of a distributed sparse matrix are proposed. We c...
متن کاملDistributed block independent set algorithms and parallel multilevel ILU preconditioners
We present a class of parallel preconditioning strategies utilizing multilevel block incomplete LU (ILU) factorization techniques to solve large sparse linear systems. The preconditioners are constructed by exploiting the concept of block independent sets (BISs). Two algorithms for constructing BISs of a sparse matrix in a distributed environment are proposed. We compare a few implementations o...
متن کاملNumerical Experiments with Parallel Orderings for Ilu Preconditioners
Incomplete factorization preconditioners such as ILU, ILUT and MILU are well-known robust general-purpose techniques for solving linear systems on serial computers. However, they are difficult to parallelize efficiently. Various techniques have been used to parallelize these preconditioners, such as multicolor orderings and subdomain preconditioning. These techniques may degrade the performance...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007